Isabelle Collections Framework
نویسنده
چکیده
This development provides an efficient, extensible, machine checked collections framework for use in Isabelle/HOL. The library adopts the concepts of interface, implementation and generic algorithm from object-oriented programming and implements them in Isabelle/HOL. The framework features the use of data refinement techniques to refine an abstract specification (using high-level concepts like sets) to a more concrete implementation (using collection datastructures, like red-black-trees). The code-generator of Isabelle/HOL can be used to generate efficient code in all supported target languages, i.e. Haskell, SML, and OCaml.
منابع مشابه
Isabelle Collections Framework
This development provides an efficient, extensible, machine checked collections framework for use in Isabelle/HOL. The library adopts the concepts of interface, implementation and generic algorithm from object-oriented programming and implements them in Isabelle/HOL. The framework features the use of data refinement techniques to refine an abstract specification (using high-level concepts like ...
متن کاملThe Isabelle Collections Framework
The Isabelle Collections Framework (ICF) provides a unified framework for using verified collection data structures in Isabelle/HOL formalizations and generating efficient functional code in ML, Haskell, and OCaml. Thanks to its modularity, it is easily extensible and supports switching to different data structures any time. For good integration with applications, a data refinement approach sep...
متن کاملBüchi Complementation
This entry provides a verified implementation of rank-based Büchi Complementation [1]. The verification is done in three steps: 1. Definition of odd rankings and proof that an automaton rejects a word iff there exists an odd ranking for it. 2. Definition of the complement automaton and proof that it accepts exactly those words for which there is an odd ranking. 3. Verified implementation of the...
متن کاملTree Automata
This work presents a machine-checked tree automata library for Standard-ML, OCaml and Haskell. The algorithms are efficient by using appropriate data structures like RB-trees. The available algorithms for non-deterministic automata include membership query, reduction, intersection, union, and emptiness check with computation of a witness for non-emptiness. The executable algorithms are derived ...
متن کاملTowards Fully Automated Axiom Extraction for Finite-Valued Logics
We implement an algorithm for extracting appropriate collections of classiclike sound and complete tableau rules for a large class of finite-valued logics. Its output consists of Isabelle theories.
متن کامل